-
1 Batcher's odd-even merge sort
English-Russian electronics dictionary > Batcher's odd-even merge sort
-
2 Batcher's odd-even merge sort
The New English-Russian Dictionary of Radio-electronics > Batcher's odd-even merge sort
-
3 sort
1) сортировка || сортировать2) класс; категория; тип; группа || классифицировать; относить к (определённому) классу, категории, типу или группе3) упорядочение || упорядочивать4) pl специальные наборные знаки; специальные символы•- sort by extension
- sort by insertion
- sort by name
- sort by selection
- sort by size
- sort by time
- address calculating sort
- address table sort
- alphanumeric sort
- ascending sort
- Batcher's odd-even merge sort
- block sort
- bogo sort
- bubble sort
- cascade sort
- cocktail shaker sort
- collating sort
- comparison counting sort
- depth sort
- descending sort
- dictionary sort
- distributive sort
- divide and conquer sort
- external sort
- file sort
- heap sort
- Hoare sort
- indirect sort
- internal sort
- key sort
- least significant digit radix sort
- manual sort
- merge sort
- most significant digit radix sort
- multipass sort
- Neumann sort
- oscillating sort
- parallel sort
- pointer sort
- polyphase sort
- property sort
- quick sort
- ripple sort
- selection sort
- shaker sort
- Shell sort
- sifting sort
- straight insertion sort
- straight selection sort
- stupid sort
- tag sort
- tape sort
- topological sort
- tree sort
- Williams sort -
4 sort
1) сортировка || сортировать2) класс; категория; тип; группа || классифицировать; относить к (определённому) классу, категории, типу или группе3) упорядочение || упорядочивать4) pl. специальные наборные знаки; специальные символы•- address table sort
- alphanumeric sort
- ascending sort
- Batcher's odd-even merge sort
- block sort
- bogo sort
- bubble sort
- cascade sort
- cocktail shaker sort
- collating sort
- comparison counting sort
- depth sort
- descending sort
- dictionary sort
- distributive sort
- divide and conquer sort
- external sort
- file sort
- heap sort
- Hoare sort
- indirect sort
- internal sort
- key sort
- least significant digit radix sort
- manual sort
- merge sort
- most significant digit radix sort
- multipass sort
- Neumann sort
- oscillating sort
- parallel sort
- pointer sort
- polyphase sort
- property sort
- quick sort
- ripple sort
- selection sort
- shaker sort
- Shell sort
- sifting sort
- sort by exchange
- sort by extension
- sort by insertion
- sort by name
- sort by selection
- sort by size
- sort by time
- straight insertion sort
- straight selection sort
- stupid sort
- tag sort
- tape sort
- topological sort
- tree sort
- Williams sortThe New English-Russian Dictionary of Radio-electronics > sort
См. также в других словарях:
Odd–even sort — Example of odd even transposition sort sorting a list of random numbers. Class Sorting algorithm Data structure Array Worst case performance … Wikipedia
Batcher odd–even mergesort — Visualization of the odd–even mergesort network with eight inputs Batcher s odd–even mergesort is a generic construction devised by Ken Batcher for sorting networks of size O(n (log n)2) and depth O((log n)2), where n is the number … Wikipedia
Merge sort — Example of merge sort sorting a list of random dots. Class Sorting algorithm Data structure Array Worst case performance O(n log n) … Wikipedia
Comb sort — Class Sorting algorithm Data structure Array Worst case performance O(n log n)[1] … Wikipedia
Counting sort — In computer science, counting sort is an algorithm for sorting a collection of objects according to keys that are small integers; that is, it is an integer sorting algorithm. It operates by counting the number of objects that have each distinct… … Wikipedia
Cocktail sort — Class Sorting algorithm Data structure Array Worst case performance О(n²) Best case performance O(n) … Wikipedia
Pigeonhole sort — Class Sorting algorithm Data structure Array Worst case performance O(N + n), where N is the range of key values and n is the input size Worst case space complexity O(N * n) … Wikipedia
Cycle sort — Example of cycle sort sorting a list of random numbers. Class Sorting algorithm Data structure Array Worst case performance Θ(n2) … Wikipedia
Sorting algorithm — In computer science, a sorting algorithm is an algorithm that puts elements of a list in a certain order. The most used orders are numerical order and lexicographical order. Efficient sorting is important for optimizing the use of other… … Wikipedia
Bogosort — Class Sorting algorithm Data structure Array Worst case performance [1] Best case performance Ω … Wikipedia
Topological sorting — Dependency resolution redirects here. For other uses, see Dependency (disambiguation). In computer science, a topological sort or topological ordering of a directed graph is a linear ordering of its vertices such that, for every edge uv, u comes… … Wikipedia
